Fun with RSA, three times!

Files given:

• Triplet.py

This challenge requires us to send in 6 primes such that . Then it asks for values such that for all .

In order to find such values, we aim to minimize the LCM of all the so that we can satisfy the inequality. This is easily done by demanding all the primes to be of the form where is small and is big. Next, we can actually set to minimize the LCM even further. After we are done, we factor in order to find possible values of . A precomputed set of coefficients is found in solve.py

Solution at genparams.sage and solve.py